0.08/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.14 % Command : run_E %s %d THM 0.14/0.36 % Computer : n021.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 960 0.14/0.36 % WCLimit : 120 0.14/0.36 % DateTime : Tue Aug 9 03:30:35 EDT 2022 0.14/0.36 % CPUTime : 0.21/0.50 Running higher-order on 8 cores theorem proving 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.21/0.50 # Version: 3.0pre003-ho 0.21/0.51 # Preprocessing class: HSMSSMSSMLMNHSN. 0.21/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.51 # Starting ho_unfolding_3 with 600s (5) cores 0.21/0.51 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.21/0.51 # Starting almost_fo_3_lam with 120s (1) cores 0.21/0.51 # Starting post_as_ho1 with 120s (1) cores 0.21/0.51 # ehoh_best2_full_lfho with pid 13817 completed with status 0 0.21/0.51 # Result found by ehoh_best2_full_lfho 0.21/0.51 # Preprocessing class: HSMSSMSSMLMNHSN. 0.21/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.51 # Starting ho_unfolding_3 with 600s (5) cores 0.21/0.51 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.21/0.51 # No SInE strategy applied 0.21/0.51 # Search class: HHHNS-FFSF11-SHSSMFNN 0.21/0.51 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.21/0.51 # Starting new_ho_10 with 65s (1) cores 0.21/0.51 # new_ho_10 with pid 13824 completed with status 0 0.21/0.51 # Result found by new_ho_10 0.21/0.51 # Preprocessing class: HSMSSMSSMLMNHSN. 0.21/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.51 # Starting ho_unfolding_3 with 600s (5) cores 0.21/0.51 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.21/0.51 # No SInE strategy applied 0.21/0.51 # Search class: HHHNS-FFSF11-SHSSMFNN 0.21/0.51 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.21/0.51 # Starting new_ho_10 with 65s (1) cores 0.21/0.51 # Preprocessing time : 0.001 s 0.21/0.51 # Presaturation interreduction done 0.21/0.51 0.21/0.51 # Proof found! 0.21/0.51 # SZS status Theorem 0.21/0.51 # SZS output start CNFRefutation 0.21/0.51 thf(decl_22, type, qmltpeq: mu > mu > $i > $o). 0.21/0.51 thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.51 thf(decl_24, type, mnot: ($i > $o) > $i > $o). 0.21/0.51 thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.51 thf(decl_26, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.21/0.51 thf(decl_27, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o). 0.21/0.51 thf(decl_28, type, mtrue: $i > $o). 0.21/0.51 thf(decl_29, type, mfalse: $i > $o). 0.21/0.51 thf(decl_30, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.51 thf(decl_31, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.51 thf(decl_32, type, mimplied: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.51 thf(decl_33, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.51 thf(decl_34, type, mxor: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.51 thf(decl_35, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o). 0.21/0.51 thf(decl_36, type, exists_in_world: mu > $i > $o). 0.21/0.51 thf(decl_37, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.21/0.51 thf(decl_38, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.21/0.51 thf(decl_39, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o). 0.21/0.51 thf(decl_40, type, mreflexive: ($i > $i > $o) > $o). 0.21/0.51 thf(decl_41, type, msymmetric: ($i > $i > $o) > $o). 0.21/0.51 thf(decl_42, type, mserial: ($i > $i > $o) > $o). 0.21/0.51 thf(decl_43, type, mtransitive: ($i > $i > $o) > $o). 0.21/0.51 thf(decl_44, type, meuclidean: ($i > $i > $o) > $o). 0.21/0.51 thf(decl_45, type, mpartially_functional: ($i > $i > $o) > $o). 0.21/0.51 thf(decl_46, type, mfunctional: ($i > $i > $o) > $o). 0.21/0.51 thf(decl_47, type, mweakly_dense: ($i > $i > $o) > $o). 0.21/0.51 thf(decl_48, type, mweakly_connected: ($i > $i > $o) > $o). 0.21/0.51 thf(decl_49, type, mweakly_directed: ($i > $i > $o) > $o). 0.21/0.51 thf(decl_50, type, mvalid: ($i > $o) > $o). 0.21/0.51 thf(decl_51, type, msatisfiable: ($i > $o) > $o). 0.21/0.51 thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o). 0.21/0.51 thf(decl_53, type, minvalid: ($i > $o) > $o). 0.21/0.51 thf(decl_54, type, rel_s4: $i > $i > $o). 0.21/0.51 thf(decl_55, type, mbox_s4: ($i > $o) > $i > $o). 0.21/0.51 thf(decl_56, type, mdia_s4: ($i > $o) > $i > $o). 0.21/0.51 thf(decl_57, type, p: $i > $o). 0.21/0.51 thf(decl_58, type, esk1_1: $i > mu). 0.21/0.51 thf(decl_59, type, esk2_0: $i). 0.21/0.51 thf(decl_60, type, esk3_0: $i). 0.21/0.51 thf(decl_61, type, esk4_1: $i > $i). 0.21/0.51 thf(decl_62, type, esk5_1: $i > $i). 0.21/0.51 thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o]:(mor @ (mnot @ X4) @ X5))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mimplies)). 0.21/0.51 thf(mnot, axiom, ((mnot)=(^[X4:$i > $o, X3:$i]:(~((X4 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mnot)). 0.21/0.51 thf(mor, axiom, ((mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)|(X5 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mor)). 0.21/0.51 thf(mdia_s4, axiom, ((mdia_s4)=(^[X4:$i > $o]:(mnot @ (mbox_s4 @ (mnot @ X4))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax', mdia_s4)). 0.21/0.51 thf(mbox_s4, axiom, ((mbox_s4)=(^[X4:$i > $o, X3:$i]:(![X7:$i]:((~((rel_s4 @ X3 @ X7))|(X4 @ X7)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax', mbox_s4)). 0.21/0.51 thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mvalid)). 0.21/0.51 thf(mtransitive, axiom, ((mtransitive)=(^[X6:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((X6 @ X15 @ X16)&(X6 @ X16 @ X17))=>(X6 @ X15 @ X17)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mtransitive)). 0.21/0.51 thf(con, conjecture, (mvalid @ (mimplies @ (mdia_s4 @ (mbox_s4 @ (mdia_s4 @ (mbox_s4 @ p)))) @ (mdia_s4 @ (mbox_s4 @ p)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', con)). 0.21/0.51 thf(a2, axiom, (mtransitive @ rel_s4), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax', a2)). 0.21/0.51 thf(mreflexive, axiom, ((mreflexive)=(^[X6:$i > $i > $o]:(![X15:$i]:((X6 @ X15 @ X15))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mreflexive)). 0.21/0.51 thf(a1, axiom, (mreflexive @ rel_s4), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax', a1)). 0.21/0.51 thf(c_0_11, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])). 0.21/0.51 thf(c_0_12, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.21/0.51 thf(c_0_13, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.21/0.51 thf(c_0_14, plain, ((mdia_s4)=(^[Z0:$i > $o, Z1:$i]:(~((![X28:$i]:((~((rel_s4 @ Z1 @ X28))|(~((Z0 @ X28)))))))))), inference(fof_simplification,[status(thm)],[mdia_s4])). 0.21/0.51 thf(c_0_15, plain, ((mbox_s4)=(^[Z0:$i > $o, Z1:$i]:(![X7:$i]:((~((rel_s4 @ Z1 @ X7))|(Z0 @ X7)))))), inference(fof_simplification,[status(thm)],[mbox_s4])). 0.21/0.51 thf(c_0_16, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11, c_0_12]), c_0_13])). 0.21/0.51 thf(c_0_17, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.21/0.51 thf(c_0_18, plain, ((mdia_s4)=(^[Z0:$i > $o, Z1:$i]:(~((![X28:$i]:((~((rel_s4 @ Z1 @ X28))|(~((Z0 @ X28)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14, c_0_12]), c_0_15])). 0.21/0.51 thf(c_0_19, plain, ((mtransitive)=(^[Z0:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((Z0 @ X15 @ X16)&(Z0 @ X16 @ X17))=>(Z0 @ X15 @ X17)))))), inference(fof_simplification,[status(thm)],[mtransitive])). 0.21/0.51 thf(c_0_20, negated_conjecture, ~(![X39:$i]:((~(~(![X36:$i]:((~(rel_s4 @ X39 @ X36)|~(![X35:$i]:((~(rel_s4 @ X36 @ X35)|~(![X34:$i]:((~(rel_s4 @ X35 @ X34)|~(![X33:$i]:((~(rel_s4 @ X34 @ X33)|(p @ X33))))))))))))))|~(![X38:$i]:((~(rel_s4 @ X39 @ X38)|~(![X37:$i]:((~(rel_s4 @ X38 @ X37)|(p @ X37)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]), c_0_16]), c_0_17]), c_0_15]), c_0_18])])). 0.21/0.51 thf(c_0_21, plain, ![X29:$i, X30:$i, X31:$i]:((((rel_s4 @ X29 @ X30)&(rel_s4 @ X30 @ X31))=>(rel_s4 @ X29 @ X31))), inference(apply_def,[status(thm)],[a2, c_0_19])). 0.21/0.51 thf(c_0_22, negated_conjecture, ![X51:$i, X53:$i, X54:$i]:((((rel_s4 @ esk2_0 @ esk3_0)&(((rel_s4 @ X51 @ (esk4_1 @ X51))|~(rel_s4 @ esk3_0 @ X51))&(~(rel_s4 @ (esk4_1 @ X51) @ X53)|(p @ X53)|~(rel_s4 @ esk3_0 @ X51))))&(((rel_s4 @ X54 @ (esk5_1 @ X54))|~(rel_s4 @ esk2_0 @ X54))&(~(p @ (esk5_1 @ X54))|~(rel_s4 @ esk2_0 @ X54))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])])). 0.21/0.51 thf(c_0_23, plain, ![X42:$i, X43:$i, X44:$i]:((~(rel_s4 @ X42 @ X43)|~(rel_s4 @ X43 @ X44)|(rel_s4 @ X42 @ X44))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])). 0.21/0.51 thf(c_0_24, plain, ((mreflexive)=(^[Z0:$i > $i > $o]:(![X15:$i]:((Z0 @ X15 @ X15))))), inference(fof_simplification,[status(thm)],[mreflexive])). 0.21/0.51 thf(c_0_25, negated_conjecture, ![X7:$i, X3:$i]:(((p @ X7)|~((rel_s4 @ (esk4_1 @ X3) @ X7))|~((rel_s4 @ esk3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_22])). 0.21/0.51 thf(c_0_26, negated_conjecture, ![X3:$i]:(((rel_s4 @ X3 @ (esk5_1 @ X3))|~((rel_s4 @ esk2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_22])). 0.21/0.51 thf(c_0_27, negated_conjecture, ![X3:$i]:((~((p @ (esk5_1 @ X3)))|~((rel_s4 @ esk2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_22])). 0.21/0.51 thf(c_0_28, plain, ![X7:$i, X3:$i, X15:$i]:(((rel_s4 @ X3 @ X15)|~((rel_s4 @ X3 @ X7))|~((rel_s4 @ X7 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_23])). 0.21/0.51 thf(c_0_29, negated_conjecture, ![X3:$i]:(((rel_s4 @ X3 @ (esk4_1 @ X3))|~((rel_s4 @ esk3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_22])). 0.21/0.51 thf(c_0_30, plain, ![X32:$i]:((rel_s4 @ X32 @ X32)), inference(apply_def,[status(thm)],[a1, c_0_24])). 0.21/0.51 thf(c_0_31, negated_conjecture, ![X3:$i]:((~((rel_s4 @ esk2_0 @ (esk4_1 @ X3)))|~((rel_s4 @ esk3_0 @ X3)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])). 0.21/0.51 thf(c_0_32, negated_conjecture, ![X3:$i, X7:$i]:(((rel_s4 @ X3 @ (esk4_1 @ X7))|~((rel_s4 @ esk3_0 @ X7))|~((rel_s4 @ X3 @ X7)))), inference(spm,[status(thm)],[c_0_28, c_0_29])). 0.21/0.51 thf(c_0_33, plain, ![X45:$i]:((rel_s4 @ X45 @ X45)), inference(variable_rename,[status(thm)],[c_0_30])). 0.21/0.51 thf(c_0_34, negated_conjecture, ![X3:$i]:((~((rel_s4 @ esk3_0 @ X3))|~((rel_s4 @ esk2_0 @ X3)))), inference(spm,[status(thm)],[c_0_31, c_0_32])). 0.21/0.51 thf(c_0_35, plain, ![X3:$i]:((rel_s4 @ X3 @ X3)), inference(split_conjunct,[status(thm)],[c_0_33])). 0.21/0.51 thf(c_0_36, negated_conjecture, (rel_s4 @ esk2_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_22])). 0.21/0.51 thf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])]), ['proof']). 0.21/0.51 # SZS output end CNFRefutation 0.21/0.51 # Parsed axioms : 74 0.21/0.51 # Removed by relevancy pruning/SinE : 0 0.21/0.51 # Initial clauses : 46 0.21/0.51 # Removed in clause preprocessing : 37 0.21/0.51 # Initial clauses in saturation : 9 0.21/0.51 # Processed clauses : 32 0.21/0.51 # ...of these trivial : 0 0.21/0.51 # ...subsumed : 1 0.21/0.51 # ...remaining for further processing : 31 0.21/0.51 # Other redundant clauses eliminated : 0 0.21/0.51 # Clauses deleted for lack of memory : 0 0.21/0.51 # Backward-subsumed : 0 0.21/0.51 # Backward-rewritten : 0 0.21/0.51 # Generated clauses : 33 0.21/0.51 # ...of the previous two non-redundant : 30 0.21/0.51 # ...aggressively subsumed : 0 0.21/0.51 # Contextual simplify-reflections : 1 0.21/0.51 # Paramodulations : 33 0.21/0.51 # Factorizations : 0 0.21/0.51 # NegExts : 0 0.21/0.51 # Equation resolutions : 0 0.21/0.51 # Propositional unsat checks : 0 0.21/0.51 # Propositional check models : 0 0.21/0.51 # Propositional check unsatisfiable : 0 0.21/0.51 # Propositional clauses : 0 0.21/0.51 # Propositional clauses after purity: 0 0.21/0.51 # Propositional unsat core size : 0 0.21/0.51 # Propositional preprocessing time : 0.000 0.21/0.51 # Propositional encoding time : 0.000 0.21/0.51 # Propositional solver time : 0.000 0.21/0.51 # Success case prop preproc time : 0.000 0.21/0.51 # Success case prop encoding time : 0.000 0.21/0.51 # Success case prop solver time : 0.000 0.21/0.51 # Current number of processed clauses : 22 0.21/0.51 # Positive orientable unit clauses : 3 0.21/0.51 # Positive unorientable unit clauses: 0 0.21/0.51 # Negative unit clauses : 1 0.21/0.51 # Non-unit-clauses : 18 0.21/0.51 # Current number of unprocessed clauses: 11 0.21/0.51 # ...number of literals in the above : 41 0.21/0.51 # Current number of archived formulas : 0 0.21/0.51 # Current number of archived clauses : 9 0.21/0.51 # Clause-clause subsumption calls (NU) : 36 0.21/0.51 # Rec. Clause-clause subsumption calls : 33 0.21/0.51 # Non-unit clause-clause subsumptions : 2 0.21/0.51 # Unit Clause-clause subsumption calls : 1 0.21/0.51 # Rewrite failures with RHS unbound : 0 0.21/0.51 # BW rewrite match attempts : 3 0.21/0.51 # BW rewrite match successes : 0 0.21/0.51 # Condensation attempts : 32 0.21/0.51 # Condensation successes : 0 0.21/0.51 # Termbank termtop insertions : 3227 0.21/0.51 0.21/0.51 # ------------------------------------------------- 0.21/0.51 # User time : 0.006 s 0.21/0.51 # System time : 0.003 s 0.21/0.51 # Total time : 0.009 s 0.21/0.51 # Maximum resident set size: 1888 pages 0.21/0.51 0.21/0.51 # ------------------------------------------------- 0.21/0.51 # User time : 0.011 s 0.21/0.51 # System time : 0.003 s 0.21/0.51 # Total time : 0.014 s 0.21/0.51 # Maximum resident set size: 1804 pages 0.21/0.51 EOF